Characteristic conditions for convergence of generalized steepest descent approximation to multivalued accretive operator equations
نویسندگان
چکیده
منابع مشابه
Convergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems
In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...
متن کاملExistence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator
In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...
متن کاملDoubly Degenerate Diiusion Equations as Steepest Descent
For p 2 (1; 1) and n > 0 we consider the scalar doubly degenerate diiusion equation @ t s ? div(jrs n j p?2 rs n) = 0 in (0; 1) (1) with no{{ux boundary conditions. We argue that this evolution problem can be understood as steepest descent of the convex functional sign(m ? 1) Z s m ; provided m := n + p ? 2 p ? 1 > 0 ; (2) w. r. t. the Wasserstein metric of order p on the space of probability d...
متن کاملConvergence analysis of a locally accelerated preconditioned steepest descent method for Hermitian-definite generalized eigenvalue problems
By extending the classical analysis techniques due to Samokish, Faddeev and Faddeeva, and Longsine and McCormick among others, we prove the convergence of preconditioned steepest descent with implicit deflation (PSD-id) method for solving Hermitian-definite generalized eigenvalue problems. Furthermore, we derive a nonasymptotic estimate of the rate of convergence of the PSD-id method. We show t...
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00328-4